74 research outputs found
Reassembling trees for the traveling salesman
Many recent approximation algorithms for different variants of the traveling
salesman problem (asymmetric TSP, graph TSP, s-t-path TSP) exploit the
well-known fact that a solution of the natural linear programming relaxation
can be written as convex combination of spanning trees. The main argument then
is that randomly sampling a tree from such a distribution and then completing
the tree to a tour at minimum cost yields a better approximation guarantee than
simply taking a minimum cost spanning tree (as in Christofides' algorithm). We
argue that an additional step can help: reassembling the spanning trees before
sampling. Exchanging two edges in a pair of spanning trees can improve their
properties under certain conditions. We demonstrate the usefulness for the
metric s-t-path TSP by devising a deterministic polynomial-time algorithm that
improves on Seb\H{o}'s previously best approximation ratio of 8/5.Comment: minor revision, final version, to appear in SIAM Journal of Discrete
Mathematics, please use color printe
Shorter Tours by Nicer Ears: 7/5-approximation for graphic TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
We prove new results for approximating the graphic TSP and some related
problems. We obtain polynomial-time algorithms with improved approximation
guarantees.
For the graphic TSP itself, we improve the approximation ratio to 7/5. For a
generalization, the connected--join problem, we obtain the first nontrivial
approximation algorithm, with ratio 3/2. This contains the graphic
--path-TSP as a special case. Our improved approximation guarantee for
finding a smallest 2-edge-connected spanning subgraph is 4/3.
The key new ingredient of all our algorithms is a special kind of
ear-decomposition optimized using forest representations of hypergraphs. The
same methods also provide the lower bounds (arising from LP relaxations) that
we use to deduce the approximation ratios
Approaching for the --path TSP
We show that there is a polynomial-time algorithm with approximation
guarantee for the --path TSP, for any fixed
. It is well known that Wolsey's analysis of Christofides'
algorithm also works for the --path TSP with its natural LP relaxation
except for the narrow cuts (in which the LP solution has value less than two).
A fixed optimum tour has either a single edge in a narrow cut (then call the
edge and the cut lonely) or at least three (then call the cut busy). Our
algorithm "guesses" (by dynamic programming) lonely cuts and edges. Then we
partition the instance into smaller instances and strengthen the LP, requiring
value at least three for busy cuts. By setting up a -stage recursive dynamic
program, we can compute a spanning tree and an LP solution such
that is in the -join polyhedron, where is the
set of vertices whose degree in has the wrong parity.Comment: Final version for Journal of the AC
Few Sequence Pairs Suffice: Representing All Rectangle Placements
We consider representations of general non-overlapping placements of
rectangles by spatial relations (west, south, east, north) of pairs of
rectangles. We call a set of representations complete if it contains a
representation of every placement of rectangles.
We prove a new upper bound of and a new lower bound of on the minimum cardinality of complete sets of representations. A
key concept in the proofs of these results are pattern-avoiding permutations.
The new upper bound directly improves upon the well-known sequence pair
representation, which has size , by only considering a restricted set
of sequence pairs. It implies theoretically faster algorithms for VLSI
placement problems
Beating the integrality ratio for s-t-tours in graphs
Among various variants of the traveling salesman problem, the s-t-path graph
TSP has the special feature that we know the exact integrality ratio, 3/2, and
an approximation algorithm matching this ratio. In this paper, we go below this
threshold: we devise a polynomial-time algorithm for the s-t-path graph TSP
with approximation ratio 1.497. Our algorithm can be viewed as a refinement of
the 3/2-approximation algorithm by Seb\H{o} and Vygen [2014], but we introduce
several completely new techniques. These include a new type of
ear-decomposition, an enhanced ear induction that reveals a novel connection to
matroid union, a stronger lower bound, and a reduction of general instances to
instances in which s and t have small distance (which works for general
metrics)
An improved upper bound on the integrality ratio for the --path TSP
We give an improved analysis of the best-of-many Christofides algorithm with
lonely edge deletion, which was proposed by Seb\H{o} and van Zuylen [2016].
This implies an improved upper bound on the integrality ratio of the standard
LP relaxation for the --path TSP
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
We present a new exact algorithm for the Steiner tree problem in
edge-weighted graphs. Our algorithm improves the classical dynamic programming
approach by Dreyfus and Wagner. We achieve a significantly better practical
performance via pruning and future costs, a generalization of a well-known
concept to speed up shortest path computations. Our algorithm matches the best
known worst-case run time and has a fast, often superior, practical
performance: on some large instances originating from VLSI design, previous
best run times are improved upon by orders of magnitudes. We are also able to
solve larger instances of the -dimensional rectilinear Steiner tree problem
for , whose Hanan grids contain up to several millions of
edges
An improved approximation algorithm for ATSP
We revisit the constant-factor approximation algorithm for the asymmetric
traveling salesman problem by Svensson, Tarnawski, and V\'egh. We improve on
each part of this algorithm. We avoid the reduction to irreducible instances
and thus obtain a simpler and much better reduction to vertebrate pairs. We
also show that a slight variant of their algorithm for vertebrate pairs has a
much smaller approximation ratio. Overall we improve the approximation ratio
from to for any . This also improves the
upper bound on the integrality ratio from to
Reducing Path TSP to TSP
We present a black-box reduction from the path version of the Traveling
Salesman Problem (Path TSP) to the classical tour version (TSP). More
precisely, we show that given an -approximation algorithm for TSP,
then, for any , there is an -approximation
algorithm for the more general Path TSP. This reduction implies that the
approximability of Path TSP is the same as for TSP, up to an arbitrarily small
error. This avoids future discrepancies between the best known approximation
factors achievable for these two problems, as they have existed until very
recently.
A well-studied special case of TSP, Graph TSP, asks for tours in unit-weight
graphs. Our reduction shows that any -approximation algorithm for Graph
TSP implies an -approximation algorithm for its path
version. By applying our reduction to the -approximation algorithm for
Graph TSP by Seb\H{o} and Vygen, we obtain a polynomial-time
-approximation algorithm for Graph Path TSP, improving on a
recent -approximation algorithm of Traub and Vygen.
We obtain our results through a variety of new techniques, including a novel
way to set up a recursive dynamic program to guess significant parts of an
optimal solution. At the core of our dynamic program we deal with instances of
a new generalization of (Path) TSP which combines parity constraints with
certain connectivity requirements. This problem, which we call -TSP, has
a constant-factor approximation algorithm and can be reduced to TSP in certain
cases when the dynamic program would not make sufficient progress
Improving the Approximation Ratio for Capacitated Vehicle Routing
We devise a new approximation algorithm for capacitated vehicle routing. Our
algorithm yields a better approximation ratio for general capacitated vehicle
routing as well as for the unit-demand case and the splittable variant. Our
results hold in arbitrary metric spaces. This is the first improvement upon the
classical tour partitioning algorithm by Haimovich and Rinnooy Kan and
Altinkemer and Gavish
- …